The semaphore codes attached to a Turing machine via resets and their various limits

k-p-Infix codes and semaphore codes

In this paper we introduce the concepts of k-p-in x codes, n-k-ps-in x languages, n-k-in xout x codes, and n-k-pre x-su x languages, which are natural generalizations of our previous work on k-pre x codes, k-in x codes and so on. We obtain several properties of k-p-in x codes and semaphore codes. The relations and hierarchies of k-p-in x codes, n-k-ps-languages, and n-kpre x-su x languages, and...

A Kinematic Turing Machine

A Turing Machine in a three dimensional discrete space environment containing movable cubic parts is described. All of the cubic parts are identical in function. The only function that a part performs is to move a neighbouring part by one unit. Parts can be connected to neighbouring parts. When one part moves, parts that it is connected to also move. An example program for the Turing Machine is...

Random walks on semaphore codes and delay de Bruijn semigroups

Alan Turing Universal Turing Machine

In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.

After the Turing Machine

Problems in implementing DNA and other types of molecular computers stem from the inherent physical nature of molecules and their reactions. The current theory of computation makes assumptions that at best are very crude approximations of the physical chemistry. A theory which took into account the physical chemistry would likely be very diierent from what we have now and should help in designi...